Reversing is Not Inherent in Lexicographical Permutation Generation
نویسندگان
چکیده
منابع مشابه
Rule based lexicographical permutation sequences
In a permutation sequence built by means of sub permutations, the transitions between successive permutations are subject to a set of n(n – 1)/2 rules that naturally group into n – 1 matrices with a high degree of regularity. By means of these rules, the sequence can be produced in O(3n!) time and O(n) space. To generate all permutations of a given set one can go for (among other things) a mini...
متن کاملLexicographical Generation of a Generalized Dyck Language
Given two disjoint alphabets T and T ] and a relation R T T ] , the generalized Dyck language D R over T T ] consists of all words w 2 (T T ]) ? which are equivalent to the empty word " under the congruence deened by x y " mod for all (x; y) 2 R. In this paper we present an algorithm that generates all words of length 2n of the generalized Dyck language lexicograph-ically. Thereby, each Dyck wo...
متن کاملXLS is Not a Strong Pseudorandom Permutation
In FSE 2007, Ristenpart and Rogaway had described a generic method XLS to construct a length-preserving strong pseudorandom permutation (SPRP) over bit-strings of size at least n. It requires a lengthpreserving permutation E over all bits of size multiple of n and a blockcipher E with block size n. The SPRP security of XLS was proved from the SPRP assumptions of both E and E. In this paper we d...
متن کاملPermutation Generation: Two New Permutation Algorithms
Two completely new algorithms for generating permutations–shift cursor algorithm and level algorithm–and their efficient implementations are presented in this paper. One implementation of shift cursor algorithm gives an optimal solution of permutation generation problem, and one implementation of level algorithm can be used to generate random permutations.
متن کاملInherent Generation of Fractals by Cellular Automata
In th is paper we propos e a method for generating fract al patterns using "classical" cellular automata. Although the prob lem of fractal generat ion for linear cellular automata has been st udied recently, this is not t he case for classical cellular automata. We first exhibit some basic techniques for the construction of the tr ansit ion function , which draws a Cantor set, and show how this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1990
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/33.3.274